On the Sperner Lemma and Its Applications
نویسنده
چکیده
This paper presents elementary combinatorial proofs of Sperner’s Lemma and discusses several non-trivial theorems to which it has been applied. Examples are the Brouwer Fixed Point Theorem, the Fundamental Theorem of Algebra, and the solution to the Cake-cutting problem.
منابع مشابه
Sperner theory pdf
In 1928 Emanuel Sperner presented a simple. Cohen, On the Sperner lemma, J. Theory 2 1967.Abstract. This paper presents elementary combinatorial proofs of Sperners. Advanced topics like degree theory or homology. Before beginning, it.ple combinatorial result known as Sperners lemma. As motivation, we examine a special case of Sperners lemma. Vick, Homology Theory.extremal two-part Sperner famil...
متن کاملOn the complexity of Sperner’s Lemma
We present several results on the complexity of various forms of Sperner’s Lemma. In the black-box model of computing, we exhibit a deterministic algorithm for Sperner problems over pseudo-manifolds of arbitrary dimension. The query complexity of our algorithm is essentially linear in the separation number of the skeleton graph of the manifold and the size of its boundary. As a corollary we get...
متن کاملExtensions of Sperner and Tucker's lemma for manifolds
The Sperner and Tucker lemmas are combinatorial analogous of the Brouwer and Borsuk Ulam theorems with many useful applications. These classic lemmas are concerning labellings of triangulated discs and spheres. In this paper we show that discs and spheres can be substituted by large classes of manifolds with or without boundary.
متن کاملCombinatorial Lemmas for Oriented Complexes
A solid combinatorial theory is presented. The generalized Sperner lemma for chains is derived from the combinatorial Stokes formula. Many other generalizations follow from applications of an n-index of a labelling defined on chains with values in primoids. Primoids appear as the most general structure for which Sperner type theorems can be formulated. Their properties and various examples are ...
متن کاملC. 3i Working Paper Alfred P. Sloan School of Management a Unified Approach to Some Combinatorial Lemmas in Topology a Unified Approach to Some Combinatorial Lemmas in Topology
Part II of this study uses the path-following theory of labelled V-complexes developed in Part I to provide constructive algorithmic proofs of a variety of combinatorial lenmas in topology. \Je demonstrate two new dual lemmas on the n-dimensional cube, and use a Generc.lized S ^erner Lemma to prove a gener lization of the Knaster-Kuratowski-y.azurkiewicz Covering Lemma on the simplex. We also s...
متن کامل